Papers with interpreted regular tree grammars
Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing (C18-1)
Copied to clipboard
| Challenge: | a split/merge algorithm for interpreted regular tree grammars is a generalization of Petrov et al. (2006) . |
| Approach: | They propose to use a split/merge algorithm for interpreted regular tree grammars to refine a large class of grammar formalisms. |
| Outcome: | The proposed algorithm captures a large class of grammar formalisms and is able to refine natural sets of nonterminals. |